On the Varieties of Languages Associated with Some Varieties of Finite Monoids with Commuting Idempotents

نویسندگان

  • Christopher J. Ash
  • T. E. Hall
  • Jean-Éric Pin
چکیده

Eilenberg has shown that there is a one-to-one correspondence between varieties of finite monoids and varieties of recognizable languages. In this paper, we give a description of a variety of languages close to the class of piecewise testable languages considered by I. Simon. The corresponding variety of monoids is the variety of J -trivial monoids with commuting idempotents. This result is then generalized to the case of finite monoids with commuting idempotents whose regular D-classes are groups from a given variety of groups.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal Noncommutative Varieties and Power Varieties

A variety of finite monoids is a class of finite monoids closed under taking submonoids, quotients and finite direct products. A language L is a subset of a finitely generated free monoid. The variety theorem of Eilenberg sets up a one to one correspondence between varieties of finite monoids and classes of languages called, appropriately, varieties of languages. Recent work in variety theory h...

متن کامل

On Varieties of Automata Enriched with an Algebraic Structure (Extended Abstract)

Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence related more general classes of regular languages with classes of more complex algebraic objects. Such generalized varieties also have natural counterparts formed by classes of finite automata equipped wi...

متن کامل

Finite Aperiodic Semigroups with Commuting Idempotents and Generalizations

Among the most important and intensively studied classes of semigroups are finite semigroups, regular semigroups and inverse semigroups. Finite semigroups arise as syntactic semigroups of regular languages and as transition semigroups of finite automata. This connection has lead to a large and deep literature on classifying regular languages by means of algebraic properties of their correspondi...

متن کامل

Products of Languages with Counter

It is well known that varieties of rational languages are in one-to-one correspondence with varieties of finite monoids. This correspondence ofte., extends to operations on languages and on monoidc. We investigate the special case of the product of languages with counter, and describe the associated operations on monoids and varieties. R&emi. On sait que les varietes de IangagEs rationnels sont...

متن کامل

Bg = Pg: a Success Story

All semigroups and monoids except free monoids and free groups are assumed finite in this paper. A monoid M divides a monoid N if M is a quotient of a submonoid of N . The set of idempotents of a monoid M is denoted E(M). The word “variety” will be used for pseudo-variety — that is, a collection of finite monoids closed under division and finite direct product. A block group is a monoid such th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Comput.

دوره 86  شماره 

صفحات  -

تاریخ انتشار 1990